Computability, noncomputability, and hyperbolic systems
نویسندگان
چکیده
In this paper we study the computability of the stable and unstable manifolds of a hyperbolic equilibrium point. These manifolds are the essential feature which characterizes a hyperbolic system. We show that (i) locally these manifolds can be computed, but (ii) globally they cannot (though we prove they are semi-computable). We also show that Smale’s horseshoe, the first example of a hyperbolic invariant set which is neither an equilibrium point nor a periodic orbit, is computable.
منابع مشابه
Computability, Noncomputability and Undecidability of Maximal Intervals of Ivps
Let (α, β) ⊆ R denote the maximal interval of existence of solutions for the initial-value problem { dx dt = f(t, x), x(t0) = x0, where E is an open subset of Rm+1, f is continuous in E and (t0, x0) ∈ E. We show that, under the natural definition of computability from the point of view of applications, there exist initial-value problems with computable f and (t0, x0) whose maximal interval of e...
متن کاملA Hierarchy of Immunity and Density for Sets of Reals
The notion of immunity is useful to classify degrees of noncomputability. Meanwhile, the notion of immunity for topological spaces can be thought of as an opposite notion of density. Based on this viewpoint, we introduce a new degree-theoretic invariant called layer density which assigns a value n to each subset of Cantor space. Armed with this invariant, we shed light on an interaction between...
متن کاملComputing the Noncomputable
We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic which is equivalent to the Turing halting problem and known to be mathematically noncomputable. Generalised quantum algorithms are also considered for some other mathematical noncom...
متن کاملNoncomputability, unpredictability, undecidability & unsovability in economic & finance theories
We outline, briefly, the role that issues of the nexus between noncomputability and unpredictability, on the one hand, and between undecidability and unsolvability, on the other, have played in Computable Economics. The mathematical underpinnings of Computable Economics are provided by (classical) recursion theory, varieties of computable and constructive analysis and aspects of combinatorial o...
متن کاملAlgorithmic Social Sciences Research Unit
We outline, briefly, the role that issues of the nexus between noncomputability and unpredictability, on the one hand, and between undecidability and unsolvability, on the other, have played in Computable Economics. The mathematical underpinnings of Computable Economics are provided by (classical) recursion theory, varieties of computable and constructive analysis and aspects of combinatorial o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 219 شماره
صفحات -
تاریخ انتشار 2012